PRISM

Benchmark
Model:eajs v.1 (MDP)
Parameter(s)N = 5, energy_capacity = 250, B = 11
Property:ExpUtil (exp-reward)
Invocation (specific)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 eajs.5.prism eajs.props --property ExpUtil -const energy_capacity=250,B=11
Execution
Walltime:53.66657018661499s
Return code:0
Relative Error:1.4422885903006456e-15
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 17:11:04 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 eajs.5.prism eajs.props_fixed --property ExpUtil -const 'energy_capacity=250,B=11'

Parsing model file "eajs.5.prism"...

Type:        MDP
Modules:     Battery Process_1 Process_2 Resources Process_3 Process_5 Process_4 
Variables:   battery_load failure_1 loc_1 t_1 t_2 loc_2 boost_1 user_1 t_3 loc_3 loc_5 t_5 t_4 loc_4 

Parsing properties file "eajs.props_fixed"...

1 property:
(1) "ExpUtil": R{"utilityLocal"}max=? [ F emptyBattery ]

---------------------------------------------------------------------

Model checking: "ExpUtil": R{"utilityLocal"}max=? [ F emptyBattery ]
Model constants: energy_capacity=250

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: energy_capacity=250

Computing reachable states...

Reachability (BFS): 73 iterations in 0.16 seconds (average 0.002151, setup 0.00)

Time for model construction: 0.763 seconds.

Type:        MDP
States:      3049471 (1 initial)
Transitions: 6977654
Choices:     4256193

Transition matrix: 25363 nodes (7 terminal), 6977654 minterms, vars: 43r/43c/5nd

Prob0E: 250 iterations in 0.72 seconds (average 0.002892, setup 0.00)

Prob1A: 1 iterations in 0.01 seconds (average 0.005000, setup 0.00)

goal = 13476, inf = 0, maybe = 3035995
Time for computing an upper bound for expected reward: 5.465 seconds.
Upper bound for max expectation (variant 2): 10488.0

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=3049471, nc=4237377, nnz=6946802, k=10] [107.3 MB]
Building sparse matrix (transition rewards)... [n=3049471, nc=4237377, nnz=105040, k=10] [29.0 MB]
Creating vector for state rewards... [23.3 MB]
Creating vector for inf... [23.3 MB]
Creating vector for lower bounds... [23.3 MB]
Creating vector for upper bounds... [23.3 MB]
Allocating iteration vectors... [4 x 23.3 MB]
TOTAL: [322.4 MB]

Starting iterations (interval iteration)...
Iteration 34: max relative diff=0.999995, 5.08 sec so far
Iteration 68: max relative diff=0.999810, 10.11 sec so far
Iteration 103: max relative diff=0.999713, 15.19 sec so far
Iteration 138: max relative diff=0.999563, 20.22 sec so far
Iteration 174: max relative diff=0.999428, 25.30 sec so far
Iteration 210: max relative diff=0.999296, 30.32 sec so far
Iteration 247: max relative diff=0.999043, 35.43 sec so far
Max relative diff between upper and lower bound on convergence: 0
Iterative method: 249 iterations in 45.90 seconds (average 0.143394, setup 10.20)
Maximum finite value in solution vector at end of interval iteration: 10.06278478984203

Value in the initial state: 10.032940688435431

Time for model checking: 52.122 seconds.

Result: 10.032940688435431 (value in the initial state)


Overall running time: 53.473 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.